A new perspective on least squares under convex constraint
نویسندگان
چکیده
منابع مشابه
Convex Total Least Squares
We study the total least squares (TLS) problem that generalizes least squares regression by allowing measurement errors in both dependent and independent variables. TLS is widely used in applied fields including computer vision, system identification and econometrics. The special case when all dependent and independent variables have the same level of uncorrelated Gaussian noise, known as ordin...
متن کاملA New Technique for Image Zooming Based on the Moving Least Squares
In this paper, a new method for gray-scale image and color zooming algorithm based on their local information is offered. In the proposed method, the unknown values of the new pixels on the image are computed by Moving Least Square (MLS) approximation based on both the quadratic spline and Gaussian-type weight functions. The numerical results showed that this method is more preferable to biline...
متن کاملRepresentation Theorem for Convex Nonparametric Least Squares
We examine a nonparametric least squares regression model where the regression function is endogenously selected from the family of continuous, monotonic increasing and globally concave functions that can be nondifferentiable. We show that this family of functions is perfectly represented by a subset of continuous, piece-wise linear functions whose intercept and slope coefficients are constrain...
متن کاملLeast-Squares Minimization Under Constraints
These algorithms are, however, not designed to perform least-squares minimization under hard constraints. This short report outlines two very simple approaches to doing this to solve problems such as the one depicted by Fig. 1. The first relies on standard Lagrange multipliers [Boyd and Vandenberghe, 2004]. The second is inspired by inverse kinematics techniques [Baerlocher and Boulic, 2004] an...
متن کاملA Statistical Perspective on Randomized Sketching for Ordinary Least-Squares
We consider statistical aspects of solving large-scale least-squares (LS) problems using randomized sketching algorithms. For a LS problem with input data (X,Y ) ∈ Rn×p × R, where n and p are both large and n p, sketching algorithms use a “sketching matrix,” S ∈ Rr×n, where r n, e.g., a matrix representing the process of random sampling or random projection. Then, rather than solving the LS pro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Annals of Statistics
سال: 2014
ISSN: 0090-5364
DOI: 10.1214/14-aos1254